Chromatic symmetric functions and H-free graphs
نویسندگان
چکیده
منابع مشابه
Chromatic classical symmetric functions
In this note we classify when a skew Schur function is a positive linear combination of power sum symmetric functions. We then use this to determine precisely when any scalar multiple of a skew Schur function is the chromatic symmetric function of some graph. As a consequence we prove that of the classical bases for symmetric functions only certain scalar multiples of the elementary symmetric f...
متن کاملChromatic Bases for Symmetric Functions
In this note we obtain numerous new bases for the algebra of symmetric functions whose generators are chromatic symmetric functions. More precisely, if {Gk}k>1 is a set of connected graphs such that Gk has k vertices for each k, then the set of all chromatic symmetric functions {XGk}k>1 generates the algebra of symmetric functions. We also obtain explicit expressions for the generators arising ...
متن کاملChromatic Symmetric Functions of Hypertrees
The chromatic symmetric function XH of a hypergraph H is the sum of all monomials corresponding to proper colorings of H. When H is an ordinary graph, it is known that XH is positive in the fundamental quasisymmetric functions FS , but this is not the case for general hypergraphs. We exhibit a class of hypergraphs H — hypertrees with prime-sized edges — for which XH is F -positive, and give an ...
متن کاملChromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کاملH-packing of k-chromatic graphs
For graphs H and G, let pH(G) denote the maximum number of edges covered by a set of edge-disjoint copies of H in G. We prove that if H is k-chromatic, then pH(G) ≥ pKk(G) − o(|V (G)|). The error term cannot be improved much, as for any δ > 0 there are graphs H with χ(H) = k such that for all n sufficiently large, there are graphs G with n vertices for which pH(G) ≤ pKk(G)−n. We present several...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2019
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-019-02034-1